Partially ordered, primitive regular semigroups
نویسندگان
چکیده
منابع مشابه
Regular ordered semigroups and intra-regular ordered semigroups in terms of fuzzy subsets
Let $S$ be an ordered semigroup. A fuzzy subset of $S$ is anarbitrary mapping from $S$ into $[0,1]$, where $[0,1]$ is theusual interval of real numbers. In this paper, the concept of fuzzygeneralized bi-ideals of an ordered semigroup $S$ is introduced.Regular ordered semigroups are characterized by means of fuzzy leftideals, fuzzy right ideals and fuzzy (generalized) bi-ideals.Finally, two m...
متن کاملregular ordered semigroups and intra-regular ordered semigroups in terms of fuzzy subsets
let $s$ be an ordered semigroup. a fuzzy subset of $s$ is anarbitrary mapping from $s$ into $[0,1]$, where $[0,1]$ is theusual interval of real numbers. in this paper, the concept of fuzzygeneralized bi-ideals of an ordered semigroup $s$ is introduced.regular ordered semigroups are characterized by means of fuzzy leftideals, fuzzy right ideals and fuzzy (generalized) bi-ideals.finally, two m...
متن کاملCategorical properties of regular partially ordered pure monomorphisms
Let a family of monomorphisms in the category A To study mathematical notions in a category A, such as injectivity, tensor products, flatness, with respect to a class M of its (mono)morphisms, one should know some of the categorical properties of the pair (A ,M ). In this paper we take A to be thecategory Pos-S of S-partially ordered sets and to be a particular class o...
متن کاملOn Regular Congruences of Ordered Semigroups
An ordered semigroup is a structure S = 〈S, ·,≤〉 with a binary operation · that is associative and a partial ordering ≤ that is compatible with the binary operation. For a given congruence relation θ of the semigroup S = 〈S, ·〉 the quotient structure S/θ = 〈S/θ, , 〉 is not in general an ordered semigroup. In this paper we study quotients of ordered semigroups. We first define a special type of ...
متن کاملPartially Ordered Regular Languages for Graph Queries
In this paper we present an extension of regular languages to support graph queries. The proposed extension is based on the introduction of a partial order on the strings of the languages. We extend regular expressions and regular grammars by introducing partial orders on strings and production rules, respectively. The relations between regular expressions and regular grammars are analyzed. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 1973
ISSN: 0037-1912,1432-2137
DOI: 10.1007/bf02389144